Paper Submitted To: Third National Symposium on Large-scale Structural Analysis for High-performance Computers and Workstations Computational Results for Parallel Unstructured Mesh Computations

The majority of nite element models in structural engineering are composed of unstructured meshes. These unstructured meshes are often very large and require signiicant computational resources; hence they are excellent candidates for massively parallel computation. Parallel solution of the sparse matrices that arise from such meshes has been studied heavily, and many good algorithms have been developed. Unfortunately, many of the other aspects of parallel unstructured mesh computation have gone largely ignored. We present a set of algorithms that allow the entire unstructured mesh computation process to execute in parallel|including adaptive mesh reenement, equation reordering, mesh partitioning, and sparse linear system solution. We brieey describe these algorithms and state results regarding their running-time and performance. We then give results from the 512-processor Intel DELTA for a large-scale structural analysis problem. These results demonstrate that the new algorithms are scal-able and eecient. The algorithms are able to achieve up to 2.2 gigaaops for this unstructured mesh problem.